A User-Friendly Interactive Algorithm of the Multicriteria Linear Integer Programming
نویسنده
چکیده
The interactive algorithms are often used [2] to solve multicriteria linear integer programming problems (MCIP). These algorithms [3, 6, 7, 11, 13] are modifications of interactive approaches solving multicriteria linear problems that include the integrality constraints. Linear integer programming problems are used as scalarizing problems in these interactive algorithms. These problems are NP-difficult problems [4]. Moreover, finding a feasible integer solution can be as difficult as finding an optimal solution. That is why in the interactive algorithms solving MCIP the time to solve the scalarizing problem plays a significant role. For this reason an effort is made to reduce the number of the integer problems solved; continuous problems (instead of integer problems) are solved and continuous (weak) nondominated solutions obtained are presented to the DM for evaluation (especially in the DM’s learning phase). Some of the interactive algorithms work with the aspiration levels of the criteria, others use weight to denote the relative significance of the criteria. Many show one while others show several (weak) nondominated solutions to the DM for evaluation at each iteration. In the paper a learning-oriented [5] interactive algorithm are suggested. The main features of the algorithm proposed, which improves the dialogue with the DM, are: they reduce the number of the integer problems solved because in most of the iterations the solutions of single criterion linear problems with continuous variables (which are easy to solve) are presented to the DM for evaluation. This is used under the assumption [10, 11] that the criteria values for the scalarizing problems with continuous variables differ relatively little from the solutions with integer variables and under the assumption that the DM prefers to work in the criteria rather than in the variable space.; at every iteration the DM provides his/her local preferences in terms of the desired changes in the criteria values of some of the criteria, the desired directions of change of the other criteria and permitted deterioration with or without set limiting БЪЛГАРСКА АКАДЕМИЯ НА НАУКИТЕ . BULGARIAN ACADEMY OF SCIENCES
منابع مشابه
An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملA Reference Neighbourhood Interactive Algorithm for Solving Multicriteria Linear Integer Programming Problems
The interactive algorithm [2] are widely used for solving multicriteria linear integer programming problems. Some of the interactive algorithms work with the aspiration levels of the criteria, others use weights to denote the relative significance of the criteria. We propose a learning-oriented [4] interactive algorithm for solving multicriteria linear integer programming problems. The main fea...
متن کاملA Partition-Based Interactive Algorithm for Solving Multicriteria Linear Integer Programming Problems*
We propose a learning-oriented interactive algorithm for solving multicriteria linear integer programming (MCLIP) problems, considered as multicriteria decision making problems. At each iteration, the DM may partition the criteria set into at most seven classes, namely: improvement, improvement by a desired amount, deterioration, deterioration by at most a certain amount, nondeterioration, chan...
متن کاملA Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کامل